List Edge-Coloring and Total Coloring in Graphs of Low Treewidth
نویسندگان
چکیده
We prove that the list chromatic index of a graph of maximum degree and treewidth ≤ √2 − 3 is ; and that the total chromatic number of a graph of maximum degree and treewidth ≤ /3 + 1 is + 1. This improves results by Meeks and Scott. C © 2015 Wiley Periodicals, Inc. J. Graph Theory 81: 272–282, 2016
منابع مشابه
List edge-colouring and total colouring in graphs of low treewidth
We prove that the list chromatic index of a graph of maximum degree ∆ and treewidth ≤ √ 2∆ − 3 is ∆; and that the total chromatic number of a graph of maximum degree ∆ and treewidth ≤ ∆/3 + 1 is ∆ + 1. This improves results by Meeks and Scott.
متن کاملThe Parameterised Complexity of List Problems on Graphs of Bounded Treewidth
We consider the parameterised complexity of several list problems on graphs, with parameter treewidth or pathwidth. In particular, we show that List Edge Chromatic Number and List Total Chromatic Number are fixed parameter tractable, parameterised by treewidth, whereas List Hamilton Path is W[1]-hard, even parameterised by pathwidth. These results resolve two open questions of Fellows, Fomin, L...
متن کاملWeighted and locally bounded list-colorings in split graphs, cographs, and partial k-trees
For a fixed number of colors, we show that, in node-weighted split graphs, cographs, and graphs of bounded tree-width, one can determine in polynomial time whether a proper list-coloring of the vertices of a graph such that the total weight of vertices of each color equals a given value in each part of a fixed partition of the vertices exists. We also show that this result is tight in some sens...
متن کاملA practical algorithm for [r, s, t]-coloring of graph
Coloring graphs is one of important and frequently used topics in diverse sciences. In the majority of the articles, it is intended to find a proper bound for vertex coloring, edge coloring or total coloring in the graph. Although it is important to find a proper algorithm for graph coloring, it is hard and time-consuming too. In this paper, a new algorithm for vertex coloring, edge coloring an...
متن کاملEdge-coloring Vertex-weightings of Graphs
Let $G=(V(G),E(G))$ be a simple, finite and undirected graph of order $n$. A $k$-vertex weightings of a graph $G$ is a mapping $w: V(G) to {1, ldots, k}$. A $k$-vertex weighting induces an edge labeling $f_w: E(G) to N$ such that $f_w(uv)=w(u)+w(v)$. Such a labeling is called an {it edge-coloring k-vertex weightings} if $f_{w}(e)not= f_{w}(echr(chr(chr('39')39chr('39'))39chr(chr('39')39chr('39'...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Journal of Graph Theory
دوره 81 شماره
صفحات -
تاریخ انتشار 2016